Subexponential-Time Computation of Isolated Primary Components of a Polynomial Ideal
نویسندگان
چکیده
We suggest an algorithm for constructing all the isolated primary components of a given polynomial ideal. At output, they are determined by systems generators up to embedded components, and also as kernels some homomorphisms. The complexity this is subexponential in size input data.
منابع مشابه
Computation on Zagreb Polynomial of Some Families of Dendrimers
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
متن کاملPlanar k-Path in Subexponential Time and Polynomial Space
In the k-Path problem we are given an n-vertex graph G together with an integer k and asked whether G contains a path of length k as a subgraph. We give the first subexponential time, polynomial space parameterized algorithm for k-Path on planar graphs, and more generally, on H-minor-free graphs. The running time of our algorithm is O(2 √ k log2 n).
متن کاملa new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولa comparison of linguistic and pragmatic knowledge: a case of iranian learners of english
در این تحقیق دانش زبانشناسی و کاربردشناسی زبان آموزان ایرانی در سطح بالای متوسط مقایسه شد. 50 دانش آموز با سابقه آموزشی مشابه از شش آموزشگاه زبان مختلف در دو آزمون دانش زبانشناسی و آزمون دانش گفتار شناسی زبان انگلیسی شرکت کردند که سوالات هر دو تست توسط محقق تهیه شده بود. همچنین در این تحقیق کارایی کتابهای آموزشی زبان در فراهم آوردن درون داد کافی برای زبان آموزان ایرانی به عنوان هدف جانبی تحقیق ...
15 صفحه اولOn the computation of graded components of Laurent polynomial rings
In this paper, we present several algorithms for dealing with graded components of Laurent polynomial rings. To be more precise, let S be the Laurent polynomial ring k[x1, . . . , xr, x ±1 r+1, . . . , x ±1 n ], k algebraicaly closed field of characteristic 0. We define the multigrading of S by an arbitrary finitely generated abelian group A. We construct a set of fans compatible with the multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2021
ISSN: ['1072-3374', '1573-8795']
DOI: https://doi.org/10.1007/s10958-021-05357-8